Priority-based lambda scheduler

نویسندگان

  • Kalpana Ganesan
  • Byrav Ramamurthy
چکیده

Optical networks provide a new dimension to meet the demands of exponentially growing traffic. Optical packet switching requires a good switch architecture, which eliminates the O/E/O conversion as much as possible. Wavelength Division Multiplexing (WDM) provides a breakthrough to exploit the huge bandwidth of the optical fiber. Different applications have different requirements, which necessitate employing differentiated services. This paper presents the idea of a priority-based λ-scheduler, where the packets are differentiated into different classes and services are provided accordingly. For example, class 0 can correspond to non real time applications like email and ftp, while class 1 can correspond to real-time audio and video communications. The architecture is based on that of the λ-scheduler and hence it has the added advantage of reduced component cost by using WDM internally.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Priority Queue Schedulers with Approximate Sorting in Output Buuered Switches

All recently proposed packet scheduling algorithms for output-bu ered switches which support QoS transmit packets in some priority order, for example, according to deadlines, virtual nishing times, eligibility times, or other timestamps that are associated with a packet. Since maintaining a sorted priority queue introduces signi cant overhead, much emphasis of QoS scheduler design is put on met...

متن کامل

An Improved Multi-Priority Preemptive Scheduler for Transputer-Based Real-Time Systems

Real-time applications require an eficient scheduler supporting multiple priority levels and fast preemption. In this paper, we propose a scheduler based on the hardware-supported scheduler of transputers, Though the hardware-supported scheduler of transputers is very eficient in terms of scheduling overhead, it should be extended to support multiple priority levels and fast preemption in order...

متن کامل

Scheduler-Aware Virtual Memory Management

Virtual memory management has come to play an increasingly adversarial role in the scheduling of processes. While it is the job of the CPU scheduler to determine the order and length of execution of processes, its attempts to meet the desired scheduling constraints are thwarted by the memory manager under memory pressure. This is because scheduler policies like priority are not supported by mem...

متن کامل

Scheduling Time-Sensitive IP Traffic

This article presents an hybrid priority queuing model based scheduler for real-time traffic differentiation. The proposed scheduler is designed as a mechanism to provide queuing delay differentiation among real-time traffic classes. The novel characteristic of the presented scheduler is the capability to simultaneously try to achieve an upper time limit for queuing delays and, under heavy load...

متن کامل

Heterogeneous CPU Services Using Differentiated Admission

We present an adaptive controlled scheduler for heterogeneous applications running on general purpose computers. Our scheduler can effectively support diverse application requirements. It employs uniform rate-based sharing. Application heterogeneity is satisfied by partitioning CPU capacity into service classes, each with a different criterion for admission control. As a result, we are able to ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003